منابع مشابه
Ambiguity of ω-Languages of Turing Machines
An ω-language is a set of infinite words over a finite alphabet X . We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ 1 of (effective) analytic subsets of Xω for some finite alphabet X . We investigate the notion of ambiguity for recursive ωlanguages with regard to acceptance by ...
متن کاملFamilies of DFAs as Acceptors of $ω$-Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ω-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the Myhill-Nerode theorem for regular languages. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular lan...
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
Constraints on Ω Λ and Ω m from Distant Type 1 a Supernovae and Cosmic Microwave
We perform a combined likelihood analysis of the latest cosmic microwave background anisotropy data and distant Type 1a Supernova data of Perlmutter et al. (1998a). Our analysis is restricted to cosmological models where structure forms from adiabatic initial fluctuations characterised by a power-law spectrum with negligible tensor component. Marginalizing over other parameters, our best fit so...
متن کاملWeak Ω-categories from Intensional Type Theory
We show that for any type in Martin-Löf Intensional Type Theory, the terms of that type and its higher identity types form a weak ω-category in the sense of Leinster. Precisely, we construct a contractible globular operad PMLId of definable “composition laws”, and give an action of this operad on the terms of any type and its identity types.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90170-2